On the descriptional complexity of Watson–Crick automata
نویسندگان
چکیده
منابع مشابه
On the descriptional complexity of Watson-Crick automata
Watson–Crick automata are finite state automata working on double-stranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper, we continue the investigation of descriptional complexity ofWatson–Crick automata initiated by Păun et al. [A. Păun, M. Păun, State and transition complexity of Watson–Crick finite automata, in: G. Ciobanu, G. Paun (Eds.), Funda...
متن کاملOn the Descriptional Complexity of Simple RL-Automata
Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. Here we study a new type of restarting automaton, the so-called t-sRLautomaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance condition. On t...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولDescriptional Complexity of the Languages KaL: Automata, Monoids and Varieties
The first step when forming the polynomial hierarchies of languages is to consider languages of the form KaL where K and L are over a finite alphabet A and from a given variety V of languages, a ∈ A being a letter. All such KaL’s generate the variety of languages BPol1(V ). We estimate the numerical parameters of the language KaL in terms of their values for K and L. These parameters include th...
متن کاملDescriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
Previously, self-verifying symmetric difference automata were defined and a tight bound of 2n−1−1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n≥ 2, there is a regular languageLn accepted by a non-unary self-verifying symmetric difference nondeterministic automaton with n states, such that its equivalent minimal deterministic fini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.05.001